Minimal length maximal green sequences and triangulations of polygons
نویسندگان
چکیده
منابع مشابه
On Minimal Triangulations of Products of Convex Polygons
We give new lower bounds for the minimal number of simplices needed in a triangulation of the product of two convex polygons, improving the lower bounds in [Bo&al05].
متن کاملPicture Groups and Maximal Green Sequences
We show that picture groups are directly related to maximal green sequence. Namely, there is a bijection between maximal green sequences and positive expressions (words in the generators without inverses) for the coxeter element of the picture groups.
متن کاملHamiltonian Triangulations and Circumscribing Polygons
Let Σ = { S1 , . . . , Sn } be a finite set of disjoint line segments in the plane. We conjecture that its visibility graph, Vis(Σ), is hamiltonian. In fact, we make the stronger conjecture that Vis(Σ) has a hamiltonian cycle whose embedded version is a simple polygon (i.e., its boundary edges are non-crossing visibility segments). We call such a simple polygon a spanning polygon of Σ. Existenc...
متن کاملFlipping Edges in Triangulations of Point Sets, Polygons and Maximal Planar Graphs
A triangulation of a point set Pn is a partitioning of the convex hull Conv (Pn) into a set of triangles with disjoint interiors such that the vertices of these triangles are in Pn, and no element of Pn lies in the interior of any of these triangles. An edge e of a triangulation T is called flippable if it is contained in the boundary of two triangles of T , and the union of these triangles for...
متن کاملConvex Polygons in Geometric Triangulations
We show that the maximum number of convex polygons in a triangulation of n points in the plane is O(1.5029). This improves an earlier bound of O(1.6181) established by van Kreveld, Löffler, and Pach (2012) and almost matches the current best lower bound of Ω(1.5028) due to the same authors. Given a planar straight-line graph G with n vertices, we also show how to compute efficiently the number ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2016
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-016-0694-6